Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences
نویسندگان
چکیده
منابع مشابه
Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences
In this paper, we discuss the reduction of errortrellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor D, we show that the associated tail-biting error-trellis can be reduced by cyclically shifting the corresponding error-subsequence by l (i.e., the power of D) time units. We see that the resulting reduced error-trellis is aga...
متن کاملCharacteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes
Basic properties of a characteristic matrix for a tail-biting convolutional code are investigated. A tail-biting convolutional code can be regarded as a linear block code. Since the corresponding scalar generator matrix G has a kind of cyclic structure, an associated characteristic matrix also has a cyclic structure, from which basic properties of a characteristic matrix are obtained. Next, usi...
متن کاملError-Trellis Construction for Tailbiting Convolutional Codes
Abstract—In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction ...
متن کاملP2 Codes: Pragmatic Trellis Codes Utilizing Punctured Convolutional Codes
In a paper [ I ] , a pragmatic approach to the design of trellis codes was described whereby the basic engine of the trellis decoder was a Viterbi Decoder for the de facto industry and government standard, rate 1/2, 64state, convolutional code. In that paper, codes for 8PSK and 16-PSK modulation were described which performed almost as well as the best trellis codes of comparable complexity (fo...
متن کاملThe trellis complexity of convolutional codes
It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm [30,10]. It has gradually become apparent that linear block codes also/]ave a natural, though not in general a regular, "minimal" trellis structure, which allows them to be decoded with a Viterbi-1ike algorithn] [2,31,22,11,27,14,12,16,24,25,8,15]....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2011
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e94.a.2894